Hypergraphs as a Uniform Diagram Representation Model
نویسنده
چکیده
When working with diagrams in visual environments like graphical diagram editors, diagrams have to be represented by an internal model. Graphs and hypergraphs are well-known concepts for such internal models. This paper shows how hypergraphs can be uniformly used for a wide range of different diagram types where hyperedges are used to represent diagram components as well as spatial relationships between components. This paper also proposes a procedure for translating diagrams into their hypergraph model, i.e., a graphical scanner, and a procedure to check the hypergraph against a hypergraph grammar defining the diagrams’ syntax, i.e., a parsing procedure. Such procedures are necessary to make use of such a hypergraph model in visual environments that support free-hand editing where the user can modify diagrams arbitrarily.
منابع مشابه
Hypergraph Representation of Diagrams in Diagram Editors
When working with diagrams in visual environments like graphical diagram editors, diagrams have to be represented by an internal model. Graphs and hypergraphs are well-known concepts for such internal models . This paper shows how hypergraphs can be uniformly used for a wide range of different diagram types where hyperedges are used to represent diagram components as well as spatial relations b...
متن کاملEMBEDDINGS AND RAMSEY NUMBERS OF SPARSE k-UNIFORM HYPERGRAPHS
Chvátal, Rödl, Szemerédi and Trotter [3] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In [6, 23] the same result was proved for 3-uniform hypergraphs. Here we extend this result to k-uniform hypergraphs for any integer k ≥ 3. As in the 3-uniform case, the main new tool which we prove and use is an embedding lemma for k-uniform hypergraphs of boun...
متن کاملD ec 2 00 6 EMBEDDINGS AND RAMSEY NUMBERS OF SPARSE k - UNIFORM HYPERGRAPHS
Chvátal, Rödl, Szemerédi and Trotter [3] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In [5, 19] the same result was proved for 3-uniform hypergraphs. Here we extend this result to k-uniform hypergraphs for any integer k ≥ 3. As in the 3-uniform case, the main new tool which we prove and use is an embedding lemma for k-uniform hypergraphs of boun...
متن کاملTowards Community Detection in k-Partite k-Uniform Hypergraphs
Recently, numerous applications have emerged that create data most naturally interpreted as k-partite k-uniform hypergraphs. We identify benefits and challenges of generalizing community detection algorithms to these structures. We propose an algorithm which handles some of these challenges and a hypergraph generalization of the “caveman” model for the generation of synthetic evaluation dataset...
متن کاملOn 3-uniform hypergraphs without linear cycles∗
We explore properties of 3-uniform hypergraphs H without linear cycles. It is surprising that even the simplest facts about ensuring cycles in graphs can be fairly complicated to prove for hypergraphs. Our main results are that 3-uniform hypergraphs without linear cycles must contain a vertex of strong degree at most two and must have independent sets of size at least 2|V (H)| 5 .
متن کامل